Real-Time Path Planning and Navigation for a Web-Based Mobile Robot Using a Modified Ant Colony Optimization Algorithm

نویسندگان

  • KUAN-YU CHEN
  • CHIA-YUN LIN
  • CHENG-CHIN CHIEN
  • JING-HUEI TSAI
  • YU-CHING LIU
چکیده

This paper presents the use of a modified ant colony optimization algorithm and interactive web technologies for the problems of real-time path planning and navigation for an autonomous mobile robot. Assume that the mobile robot serves in an office building for delivering documents and packages, and all staff in different locations can assign tasks to the robot via a web-based application. Therefore, how to rapidly determine or update the path planning for the robot is a top priority. In this paper, we firstly apply interactive web technologies to develop the web-based application including two interfaces of client-side and server-side. The client-side is a graphical user interface for task assignments and monitoring real-time state of the mobile robot; moreover, the server-side interface combines the computation kernel of a modified ant colony optimization algorithm for generating a feasible path planning with a database management system for recording purpose. Secondly, a precise indoor localization system for the mobile robot using wireless sensor network and binocular vision is also presented. Finally, simulation results show that our proposed approach allows users to assign tasks to the mobile robot via the Internet, and then the mobile robot can complete these tasks along a feasible path that is generated by a modified ant colony optimization algorithm. Key-Words: Ant colony optimization, mobile robot, path planning, web-based interface, wireless sensor network localization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ant-Q agent System Based Path Optimization Service for a Multi- Objective Mobile Robot and Real World

A multi-objective mobile robot path planning algorithm based on improved Ant-Q agent system algorithm is proposed. The most Driver has Navigation system. It is convenient if him use the Navigation system. But, Navigation systems are not able to determine optimized driving routes considering that each driver has specific driving habits and propensities and many circumstantial changes are present...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

SmartPATH: An Efficient Hybrid ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots

Path planning is a fundamental optimization problem that is crucial for the navigation of a mobile robot. Among the vast array of optimization approaches, we focus in this paper on Ant Colony Optimization (ACO) and Genetic Algorithms (GA) for solving the global path planning problem in a static environment, considering their effectiveness in solving such a problem. Our objective is to design an...

متن کامل

A Novel Method for Path Planning of Mobile Robots via Fuzzy Logic and ant Colony Algorithem in Complex Daynamic Environments

Researches on mobile robot path planning with meta-heuristic methods to improve classical approaches have grown dramatically in the recent 35 years. Because routing is one of the NP-hard problems, an ant colony algorithm that is a metaheuristic method has had no table success in this area. In this paper, a new approach for solving mobile robot navigation in dynamic environments, based on the he...

متن کامل

Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation

In the Motion Planning research field, heuristic methods have demonstrated to outperform classical approaches gaining popularity in the last 35 years. Several ideas have been proposed to overcome the complex nature of this NP-Complete problem. Ant Colony Optimization algorithms are heuristic methods that have been successfully used to deal with this kind of problems. This paper presents a novel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013